Signed shape tilings of squares
نویسنده
چکیده
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the same shape as T . The main tool we use is a variant of F.W.Barnes’s algebraic theory of brick packing, which converts tiling problems into problems in commutative algebra.
منابع مشابه
99 9 Signed Shape Tilings of Squares ∗
Let T be a tile made up of finitely many rectangles whose corners have rational coordinates and whose sides are parallel to the coordinate axes. This paper gives necessary and sufficient conditions for a square to be tilable by finitely many Qweighted tiles with the same shape as T , and necessary and sufficient conditions for a square to be tilable by finitely many Z-weighted tiles with the sa...
متن کاملCounting Colorful Tilings of Rectangular Arrays
In this paper we give recursive formulas for the number of colorful tilings of small rectangular arrays. We enumerate the tilings of a 2 × n board with painted squares, dominoes, and I-trominoes. We also provide a recursion formula for the number of tilings of a 3 × n board with colorful squares and dominoes. Finally, we describe a general method for calculating the number of colorful tilings o...
متن کاملOn the number of tilings of the rectangular board with T-tetronimoes
The classical combinatorial problem of counting domino tilings of a 2n × 2m rectangle was solved by P.W. Kasteleyn and also by H.N.V. Temperley and M.E. Fisher in 1961. We shall consider the similar problem for T-tetrominoes, that is, pieces formed by 4 unit squares in the shape of a T. We give explicit formulae for the number of tilings with T-tetrominoes for the 4n × 4m rectangle when n = 1, ...
متن کاملMixing Time for Square Tilings
We consider tilings of Z by two types of squares. We are interested in the rate of convergence to the stationarity of a natural Markov chain defined for square tilings. The rate of convergence can be represented by the mixing time which measures the amount of time it takes the chain to be close to its stationary distribution. We prove polynomial mixing time for n× logn regions in the case of ti...
متن کاملTiling a (2 × n)-Board with Squares and Dominoes
The Fibonacci numbers and the Pell numbers can be interpreted as the number of tilings of a (1 × n)-board by colored squares and dominoes. We explore the tilings of (2 × n)-boards by colored squares and dominoes. We develop a recurrence relation and prove several combinatorial identities in the style of recent work by Benjamin and Quinn. We also give a bijection between these (2 × n)-tilings an...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Discrete Mathematics
دوره 215 شماره
صفحات -
تاریخ انتشار 2000